Chinese Sentence Decomposition Based on Hierarchical Word Order
نویسندگان
چکیده
منابع مشابه
Chinese Word Sense Induction based on Hierarchical Clustering Algorithm
Sense induction seeks to automatically identify word senses of polysemous words encountered in a corpus. Unsupervised word sense induction can be viewed as a clustering problem. In this paper, we used the Hierarchical Clustering Algorithm as the classifier for word sense induction. Experiments show the system can achieve 72% F-score about train-corpus and 65% F-score about test-corpus.
متن کاملChinese Sentence Tokenization Using a Word Classifier
In this paper, we explore a Chinese sentence tokenizer built using a word classifier. In contrast to the state of the art conditional random field approaches, this one is simple to implement and easy to train. The work is broken down into two pieces: the sentence maximizer makes guesses over a large number of sentence tokenization candidates and scores each one. The highest scored sentence toke...
متن کاملPrim ing Word Order in Sentence Production
When producing a sentence, the speaker needs to place words in linear order. We hypothesized the existence of a linearizationprocess, which imposes order on a constituent structure. This structure is assumed to be speci® ed with respect to hierarchial relations between constituentsbut not with respect to word order.We tested this hypothesis in a primed picture description experiment. Speakers o...
متن کاملFeature selection based on word–sentence relation1
Feature selection proved to improve both the speed and the quality of classification. Methods such as mutual information, information gain or chi-square are all based on the joint distribution of classes and words; there exist only a few methods which exploit contextual information for feature selection. We introduce an algorithm based on word and word pair frequencies that reduces both vocabul...
متن کاملDependency Based Chinese Sentence Realization
This paper describes log-linear models for a general-purpose sentence realizer based on dependency structures. Unlike traditional realizers using grammar rules, our method realizes sentences by linearizing dependency relations directly in two steps. First, the relative order between head and each dependent is determined by their dependency relation. Then the best linearizations compatible with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2020
ISSN: 1877-0509
DOI: 10.1016/j.procs.2020.02.063